Idempotent Probability Measures, I

نویسنده

  • M. ZARICHNYI
چکیده

The set of all idempotent probability measures (Maslov measures) on a compact Hausdorff space endowed with the weak* topology determines is functorial on the category Comp of compact Hausdorff spaces. We prove that the obtained functor is normal in the sense of E. Shchepin. Also, this functor is the functorial part of a monad on Comp. We prove that the idempotent probability measure monad contains the hyperspace monad as its submonad. A counterpart of the notion of Milyutin map is defined for the idempotent probability measures. Using the fact of existence of Milyutin maps we prove that the functor of idempotent probability measures preserves the class of open surjective maps. Unlikely to the case of probability measures, the correspondence assigning to every pair of idempotent probability measures on the factors the set of measures on the product with these marginals, is not open.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kybernet Ika — Manuscr Ipt Prev Iew an Idempotent Algorithm for a Class of Network-disruption Games

A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along th...

متن کامل

Theory of cost measures : convergence of decision variables

Considering probability theory in which the semifield of positive real numbers is replaced by the idempotent semifield of real numbers (union infinity) endowed with the min and plus laws leads to a new formalism for optimization. Probability measures correspond to minimums of functions that we call cost measures, whereas random variables correspond to constraints on these optimization problems ...

متن کامل

An idempotent algorithm for a class of network-disruption games

A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along th...

متن کامل

Geometrical aspects of possibility measures on finite domain MV-clans

In this paper we study generalized possibility and necessity measures on MV-algebras of [0, 1]valued functions (MV-clans) in the framework of idempotent mathematics, where the usual field of reals R is replaced by the max-plus semiring Rmax. We prove results about extendability of partial assessments to possibility and necessity measures, and we characterize the geometrical properties of the sp...

متن کامل

New semantics for quantitative possibility theory

New semantics for numerical values given to possibility measures are provided. For epistemic possibilities, the new approach is based on the semantics of the transferable belief model, itself based on betting odds interpreted in a less drastic way than what subjective probabilities presupposes. It is shown that the least informative among the belief structures that are compatible with prescribe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006